Translation-based approaches for solving disjunctive temporal problems with preferences
نویسندگان
چکیده
منابع مشابه
Solving disjunctive temporal problems with preferences using maximum satisfiability
The Disjunctive Temporal Problem (DTP) involves conjunction of DTP constraints, each DTP constraint being a disjunction of difference constraints of the form x − y ≤ c, where x and y range over a domain of interpretation, and c is a numeric constant. The DTP is recognized to be an expressive framework for constraints modeling and processing. The addition of preferences, in the form of weights a...
متن کاملSolving Over-constrained Disjunctive Temporal Problems with Preferences
We present an algorithm and pruning techniques for efficiently finding optimal solutions to over-constrained instances of the Disjunctive Temporal Problem with Preferences (DTPP). Our goal is to remove the burden from the knowledge engineer who normally must reason about an inherent trade-off: including more events and tighter constraints in a DTP leads to higher-quality solutions, but decrease...
متن کاملA Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences
Disjunctive Temporal Problems with Preferences (DTPPs) extend DTPs with piece-wise constant preference functions associated to each constraint of the form l ≤ x − y ≤ u, where x, y are (real or integer) variables, and l, u are numeric constants. The goal is to find an assignment to the variables of the problem that maximizes the sum of the preference values of satisfied DTP constraints, where s...
متن کاملTwo Approaches to Semi-Dynamic Disjunctive Temporal Problems
This paper considers two approaches to improving efficiency and stability in semi-dynamic Disjunctive Temporal Problems (DTPs). A semi-dynamic DTP is a sequence of DTPs (Stergiou and Koubarakis 1998) in which each problem is a restriction of the problem before. We consider three basic types of DTP restrictions—tightening the bound of an existing constraint, adding a simple constraint, and addin...
متن کاملAnt-Based Approaches for Solving Autocorrelation Problems
We propose two ant–based formulations for solving autocorrelation problems. The formulations are combined with different ACO variants. Preliminary experiments of the derived approaches are conducted on two hard instances of the problem. Their performance is compared to an efficient Tabu Search algorithm, offering useful conclusions and motivation for further investigation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2018
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-018-9293-6